his folder contains the following files:
1. 02490rxP802-15_SG3a-Channel-Modeling-Subcommittee-Report-Final.doc: This is the final
report of the channel modeling sub-committee.
2. cmx_imr.csv (x=1, 2, 3, and 4) represent the files containing the actual 100 channel
realizations for CM1, CM2, CM3, and CM4. The columns are organized as (time, amp, time, amp,...)
3. cmx_imr_np.csv (x=1, 2, 3, and 4) represent the files containing the number of paths in
each of the 100 multipath realizations.
4. cmx_imr.mat (x=1, 2, 3, and 4) are the .mat files that can be loaded directly into
Matlab (TM).
5. *.m files are the Matlab (TM) files used to generate the various channel realizations.
標簽：
a-Channel-Modeling-Subcommittee-R
following
contains
folder
上傳時間：
2013-12-21
上傳用戶：hxy200501
Floyd-Warshall算法描述
1)適用范圍：
a)APSP(All Pairs Shortest Paths)
b)稠密圖效果最佳
c)邊權可正可負
2)算法描述：
a)初始化：dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] Then
Dis[I,j]:=dis[I,k]+dis[k,j]
c)算法結束：dis即為所有點對的最短路徑矩陣
3)算法小結：此算法簡單有效，由于三重循環結構緊湊，對于稠密圖，效率要高于執行|V|次Dijkstra算法。時間復雜度O(n^3)。
考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的，我們可以把dis設成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍色部分，可以更直觀地得到I,j的連通情況。
標簽：
Floyd-Warshall
Shortest
Pairs
Paths
上傳時間：
2013-12-01
上傳用戶：dyctj
